A chance-constrained stochastic approach to intermodal container routing problems
نویسندگان
چکیده
منابع مشابه
A chance-constrained stochastic approach to intermodal container routing problems
We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service ...
متن کاملA chance-constrained approach to stochastic line balancing problem
In this paper, chance-constrained 0–1 integer programming models for the stochastic traditional and U-type line balancing (ULB) problem are developed. These models are solved for several test problems that are well known in the literature and the computational results are given. In addition, a goal programming approach is presented in order to increase the system reliability, which is arising f...
متن کاملFuzzy Goal Programming Approach to Chance Constrained Multilevel Programming Problems
This paper presents a fuzzy goal programming (FGP) procedure for solving multilevel programming problems (MLPPs) having chance constraints in large hierarchical decision organizations. In the proposed approach, first the chance constraints of a problem are converted into their respective deterministic equivalent in the decision making context. Then, the objective functions of decision makers (D...
متن کاملOptimization Approaches for Solving Chance Constrained Stochastic Orienteering Problems
Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadline. Stochastic orienteering problems (SOPs) extend OPs to account for uncertain travel times and a...
متن کاملSolving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities
We study a complex class of stochastic programming problems involving a joint chance constraint with random technology matrix and stochastic quadratic inequalities. We present a basic mixedinteger nonlinear reformulation based on Boolean modeling and derive several variants of it. We present detailed empirical results comparing the various reformulations and several easy to implement algorithmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0192275